Mehar Approach for Finding Shortest Path in Supply Chain Network

نویسندگان

چکیده

The aim of each company/industry is to provide a final product customers at the minimum possible cost, as well protect environment from degradation. Ensuring shortest travel distance between involved locations plays an important role in achieving company’s/industry’s objective (i) cost can be minimized by minimizing total travelled (ii) finding will require less fuel than longest locations. This eventually result lesser degradation environment. Hence, last few years, various algorithms have been proposed solve different types path problems. A recently algorithm for solving interval-valued Pythagorean fuzzy problems requires excessive computational efforts. reduce efforts, this paper, firstly, alternative lexicographic method comparing numbers. Then, using method, new approach (named Mehar approach) Furthermore, superiority approach, discussed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic Algorithm for Finding Shortest Path in a Network

This paper presents a genetic algorithm based on a strategy to find the shortest path in a network with variable length chromosomes (strings) and their genes have been used for encoding the problem. Crossover and mutation together provide improved quality of solution. Even though shortest path algorithms are already well established, this paper proposing a simple method of finding shortest path...

متن کامل

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

Finding the shortest path with PesCa: a tool for network

Network analysis is of growing interest in several fields ranging from economics to biology. Several methods have been developed to investigate different properties of physical networks abstracted as graphs, including quantification of specific topological properties, contextual data enrichment, simulation of pathway dynamics and visual representation. In this context, the PesCa app for the Cyt...

متن کامل

A Novel Approach for Finding a Shortest Path in a Mixed Fuzzy Network

We present a novel approach for computing a shortest path in a mixed fuzzy network, network having various fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy numbers in a path using α -cuts. Then, we present a dynamic programming method for finding a shortest path in the network. For this, we apply a recently proposed distance function for comparison of fuzzy...

متن کامل

Finding the Shortest Path in Dynamic Network using Labeling Algorithm

This study concerns the problem of finding shortest paths from one node to all other nodes in networks for which arc costs can vary with time, each arc has a transit time and parking with a corresponding time-varying cost is allowed at the nodes. it show that this problem is equivalent to a classical shortest path problem in a timeexpanded network. The label correcting algorithm is used for fin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sustainability

سال: 2021

ISSN: ['2071-1050']

DOI: https://doi.org/10.3390/su13074016